nL -Iteration Complexity
نویسندگان
چکیده
This paper proposes an improved predictor-corrector interior-point algorithm for the linear complementarity problem LCP based on the Mizuno-Todd-Ye algorithm. The modified corrector steps in our algorithm cannot only draw the iteration point back to a narrower neighborhood of the center path but also reduce the duality gap. It implies that the improved algorithm can converge faster than the MTY algorithm. The iteration complexity of the improved algorithm is proved to obtain O √ nL which is similar to the classical Mizuno-Todd-Ye algorithm. Finally, the numerical experiments show that our algorithm improved the performance of the classical MTY algorithm.
منابع مشابه
An Infeasible{interior{point Method for the P -matrix Lcp
A predictor-corrector method for solving the P (k)-matrix linear complementarity problems from infeasible starting points is analyzed. Two matrix factorizations and at most three backsolves are to be computed at each iteration. The computational complexity depends on the quality of the starting points. If the starting points are large enough then the algorithm has O ? (+ 1) 2 nL iteration compl...
متن کاملA Superlinearly Convergent O( P Nl)-iteration Algorithm for Linear Programming
In this note we consider a large step modiication of the Mizuno-Todd-Ye O(p nL) predictor-corrector interior-point algorithm for linear programming. We demonstrate that the modiied algorithm maintains its O(p nL)-iteration complexity, while exhibiting superlinear convergence for general problems and quadratic convergence for non-degenerate problems. To our knowledge, this is the rst constructio...
متن کاملAn O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence*
The Mizuno-Todd-Ye predictor-corrector algorithm for linear programming is extended for solving monotone linear complementarity problems from infeasible starting points. The proposed algorithm requires two matrix factorizations and at most three backsolves per iteration. Its computational complexity depends on the quality of the starting point. If the starting points are large enough, then the ...
متن کاملSemantic Analysis of Time and Tense in Natural Language: An Implementation
In this paper a model for temporal references in natural language (NL) is studied and a Prolog implementation of it is presented. This model is intended to be a common framework for semantic analysis of verb tenses and temporal adverbial phrases. The time model choosen was based on time intervals and temporal relations. The notion of “proposition type” and temporal concepts of tense, aspect, du...
متن کاملA Modiied O(nl) Infeasible-interior-point Algorithm for Lcp with Quadratic Convergence
A modiied predictor-corrector algorithm is proposed for solving monotone linear complementarity problems from infeasible starting points. The algorithm terminates in O(nL) steps either by nding a solution or by determining that the problem is not solvable. The complexity of the algorithm depends on the quality of the starting point. If the problem is solvable and if a certain measure of feasibi...
متن کامل